On the number of frames in binary words
نویسندگان
چکیده
منابع مشابه
On the number of frames in binary words
A frame is a square uu, where u is an unbordered word. Let F (n) denote the maximum number of distinct frames in a binary word of length n. We count this number for small values of n and show that F (n) is at most bn/2c + 8 for all n and greater than 7n/30− for any positive and infinitely many n. We also show that Fibonacci words, which are known to contain plenty of distinct squares, have only...
متن کاملthe impact of e-readiness on ec success in public sector in iran the impact of e-readiness on ec success in public sector in iran
acknowledge the importance of e-commerce to their countries and to survival of their businesses and in creating and encouraging an atmosphere for the wide adoption and success of e-commerce in the long term. the investment for implementing e-commerce in the public sector is one of the areas which is focused in government‘s action plan for cross-disciplinary it development and e-readiness in go...
the washback effect of discretepoint vs. integrative tests on the retention of content in knowledge tests
در این پایان نامه تاثیر دو نوع تست جزیی نگر و کلی نگر بر به یادسپاری محتوا ارزیابی شده که نتایج نشان دهندهکارایی تستهای کلی نگر بیشتر از سایر آزمونها است
15 صفحه اولthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
The number of binary rotation words
We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be Θ(n). The result continues the line initiated by the formula for the number of all Sturmian words obtained by Lipatov [Problemy Kibernet. 39 (1982) 67–84], then independ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.05.032